Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:("Código longitud variable")

Document Type [dt]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Publication Year[py]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Discipline (document) [di]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Language

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Author Country

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Results 1 to 25 of 270

  • Page / 11
Export

Selection :

  • and

Maximal bifix codesBRUYERE, V; PERRIN, D.Theoretical computer science. 1999, Vol 218, Num 1, pp 107-121, issn 0304-3975Conference Paper

Generalised T-codes : extended construction algorithm for self-synchronising codesTITCHENER, M. R.IEE proceedings. Communications. 1996, Vol 143, Num 3, pp 122-128, issn 1350-2425Article

A partial result about the factorization conjecture for finite variable-length codesDE FELICE, C.Discrete mathematics. 1993, Vol 122, Num 1-3, pp 137-152, issn 0012-365XArticle

New malicious code detection using variable length n-gramsKRISHNA SANDEEP REDDY, D; SUBRAT KUMAR DASH; PUJARI, Arun K et al.Lecture notes in computer science. 2006, pp 276-288, issn 0302-9743, isbn 978-3-540-68962-1, 1Vol, 13 p.Conference Paper

(M - 1) and (M - 2) selfsynchronising M-ary codes generated with coding efficiencyYEN, W. F.IEE proceedings. Communications. 1998, Vol 145, Num 2, pp 65-72, issn 1350-2425Article

Database of best T-codesHIGGIE, G. R.IEE proceedings. Computers and digital techniques. 1996, Vol 143, Num 4, pp 213-218, issn 1350-2387Article

A simple variable-length codeGOLIN, S. J.Signal processing. 1995, Vol 45, Num 1, pp 23-35, issn 0165-1684Article

On codes having no finite completionNGUYEN HUONG LAM.Informatique théorique et applications (Imprimé). 1995, Vol 29, Num 2, pp 145-155, issn 0988-3754Article

Constructing finite pseudo-random strings using codeset-based entropy measuresSPEIDEL, U.IEE proceedings. Circuits, devices and systems. 2006, Vol 153, Num 4, pp 315-319, issn 1350-2409, 5 p.Conference Paper

Improved upper bound for the redundancy of fix-free codesYEKHANIN, Sergey.IEEE transactions on information theory. 2004, Vol 50, Num 11, pp 2815-2818, issn 0018-9448, 4 p.Article

On maximal synchronous codesGUESNET, Yannick.Theoretical computer science. 2003, Vol 307, Num 1, pp 129-138, issn 0304-3975, 10 p.Conference Paper

Robust decoding of VLC encoded Markov sourcesGUYADER, Arnaud; FABRE, Eric; GUILLEMOT, Christine et al.Symposium on signal and image processingColloque sur le traitement du signal et des images. 2001, 2Vol, vol1, 239-242Conference Paper

Recursively indexed quantization of memoryless sourcesSAYOOD, K; NA, S.IEEE transactions on information theory. 1992, Vol 38, Num 5, pp 1602-1609, issn 0018-9448Article

Lossy LAS file compression using uniform space divisionLIPUS, B; ZALIK, B.Electronics letters. 2012, Vol 48, Num 20, pp 1278-1279, issn 0013-5194, 2 p.Article

Using CSP to model the synchronisation process of variable length codesFONG, A. C. M; SIMPSON, A.IEE proceedings. Communications. 2006, Vol 153, Num 2, pp 195-200, issn 1350-2425, 6 p.Article

Completing a code in a regular submonoid of the free monoidNERAUD, Jean.Lecture notes in computer science. 2005, pp 281-291, issn 0302-9743, isbn 3-540-25261-4, 11 p.Conference Paper

Algorithm for creating (M-1) selfsynchronising M-ary variable length codesYEN, W.-F.Electronics Letters. 1991, Vol 27, Num 9, pp 740-742, issn 0013-5194, 3 p.Article

Comment on Algorithm for construction of variable length code with limited maximum word lengthDE LAMEILLIEURE, J. L. P; BRUYLAND, I.IEEE transactions on communications. 1986, Vol 34, Num 12, pp 1252-1253, issn 0090-6778Article

Completing codes and the Rédei property of groupsSZABO, Sandor.Theoretical computer science. 2006, Vol 359, Num 1-3, pp 449-454, issn 0304-3975, 6 p.Article

Mezzanine compression for HDTVRUSSELL, R. T.SMPTE motion imaging journal. 2006, Vol 115, Num 1, pp 16-23, issn 1545-0279, 8 p.Article

Transcoder system with high processing efficiency to support simultaneous multirate outputNAGAYOSHI, I; WAKUI, M; HANAMURA, T et al.IEE conference publication. 2003, pp 250-253, issn 0537-9989, isbn 0-85296-757-8, 4 p.Conference Paper

Optical CDMA codes for use in a lightwave communication network with multiple data ratesZHANG, Jian-Guo.European transactions on telecommunications. 2002, Vol 13, Num 3, pp 257-267, issn 1124-318XArticle

Recursive MDS-codes and pseudogeometriesCOUSELO, E; GONZALEZ, S; MARKOV, V et al.Lecture notes in computer science. 1999, pp 211-220, issn 0302-9743, isbn 3-540-66723-7Conference Paper

An error concealment algorithm for images subject to channel errorsWAI-MAN LAM; REIBMAN, A. R.IEEE transactions on image processing. 1995, Vol 4, Num 5, pp 533-542, issn 1057-7149Article

Extending C with arrays of variable lengthCHENG, H. H.Computer standards & interfaces. 1995, Vol 17, Num 4, pp 375-406, issn 0920-5489Article

  • Page / 11